Automata Construction for PSL

The language PSL [1] is a temporal logic standardized by the Accellera standards organization and currently undergoing the process of becoming an IEEE standard. The core of PSL, denoted here LTL WR, is an extension of the linear temporal logic LTL. The extension takes two orthogonal directions. In one direction the logic is interpreted over finite, possibly truncated, as well as infinite words. Truncated words are words that are finite, but not necessarily maximal. Reasoning over truncated words (as well as maximal words) is important for incomplete verification methods such as simulation and bounded model checking as well as for supporting abort/reset operators [7]. In another direction, new basic formulas and operators are added to the language. The new basic formulas are weak and strong regular expressions [6], and the new operators are suffix conjunction/implication that combine regular expressions with other formulas. In this document we provide automata construction for LTL WR. We show that for every LTL WR formula φ there exists a Büchi automaton whose size is exponential in the size of φ. In addition, we classify the complexity of model checking simple properties of the regular expression layer. The suggested constructions can be used in the process of model checking PSL properties using the automata-theoretic approach. A construction for a logic extending LTL with suffix conjuction/implication operators, interpreted over infinite words appears in [9]. A construction for a logic extending LTL with suffix conjunction/implication operators, interpreted over finite/infinite maximal words appears in [10]. A construction for reasoning over truncated words, via reset operators appears in [2]. Our contribution is twofold. First, we are the first to show a construction for weak regular expressions.